Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability

نویسندگان

  • Thomas Brihaye
  • Véronique Bruyère
  • Noémie Meunier
  • Jean-François Raskin
چکیده

We study n-player turn-based games played on a finite directed graph. For each play, the players have to pay a cost that they want to minimize. Instead of the well-known notion of Nash equilibrium (NE), we focus on the notion of subgame perfect equilibrium (SPE), a refinement of NE well-suited in the framework of games played on graphs. We also study natural variants of SPE, named weak (resp. very weak) SPE, where players who deviate cannot use the full class of strategies but only a subclass with a finite number of (resp. a unique) deviation step(s). Our results are threefold. Firstly, we characterize in the form of a Folk theorem the set of all plays that are the outcome of a weak SPE. We also establish a weaker version of this theorem for SPEs. Secondly, for the class of quantitative reachability games, we prove the existence of a finite-memory SPE and provide an algorithm for computing it (only existence was known with no information regarding the memory). Moreover, we show that the existence of a constrained SPE, i.e. an SPE such that each player pays a cost less than a given constant, can be decided. The proofs rely on our Folk theorem for weak SPEs (which coincide with SPEs in the case of quantitative reachability games) and on the decidability of MSO logic on infinite words. Finally with similar techniques, we provide a second general class of games for which the existence of a (constrained) weak SPE is decidable. 1998 ACM Subject Classification B.6.3 [design aids]: automatic synthesis; F.1.2 [Modes of computation]: interactive and reactive computation

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games

We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria ...

متن کامل

Subgame Perfection for Equilibria in Quantitative Reachability Games

We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria ...

متن کامل

The refined best-response correspondence and backward induction

Fixed points of the (most) refined best-reply correspondence, introduced in Balkenborg, Hofbauer, and Kuzmics (2009), in the agent normal form of extensive form games have a remarkable, one might call subgame consistency property. They automatically induce fixed points of the same correspondence in the agent normal form of every subgame. Furthermore, in a well-defined sense fixed points of this...

متن کامل

Multistage Game Models and Delay Supergames

The order of stages in a multistage game is often interpreted by looking at earlier stages as involving more long term decisions. For the purpose of making this interpretation precise, the notion of a delay supergame of a bounded multistage game is introduced. A multistage game is bounded if the length of play has an upper bound. A delay supergame is played over many periods. Decisions on all s...

متن کامل

Subgame Perfect Equilibria in Stage Games

It is well known that a stage game with infinite choice-sets, unless it contains a public coordination-device in each stage, may have no subgame perfect equilibria. We show that if a game with public coordination-devices has a subgame perfect equilibrium in which two players in each stage use non-atomic strategies, then the game without coordination devices also has a subgame perfect equilibrium.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015